Representations of Bicircular Lift Matroids

نویسندگان

  • Rong Chen
  • Zifei Gao
چکیده

Bicircular lift matroids are a class of matroids defined on the edge set of a graph. For a given graph G, the circuits of its bicircular lift matroid are the edge sets of those subgraphs of G that contain at least two cycles, and are minimal with respect to this property. The main result of this paper is a characterization of when two graphs give rise to the same bicircular lift matroid, which answers a question proposed by Irene Pivotto. In particular, aside from some appropriately defined “small” graphs, two graphs have the same bicircular lift matroid if and only if they are 2-isomorphic in the sense of Whitney.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Biased graphs. VII. Contrabalance and antivoltages

We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief example being a matroid associated with spanning forests. (These are bias and lift matroids of contrabalanced biased graphs.) The theory is expressed largely in terms of antivoltages (edge labellings that defy Kirchhoff’s volt...

متن کامل

Supersolvable Frame-matroid and Graphic-lift Lattices

A geometric lattice is a frame if its matroid, possibly after enlargement, has a basis such that every atom lies under a join of at most two basis elements. Examples include all subsets of a classical root system. Using the fact that nitary frame matroids are the bias matroids of biased graphs, we characterize modular coatoms in frames of nite rank and we describe explicitly the frames that are...

متن کامل

Representations of bicircular matroids

Coullard, C.R., J.G. de1 Greco and D.K. Wagner, Representations of bicircular matroids, Discrete Applied Mathematics 32 (1991) 223-240. A bicircular matroid is a matroid defined on the edge set of a graph. Two different graphs can have the same bicircular matroid. The first result of this paper is a characterization of the collection of graphs having the same bicircular matroid as a given arbit...

متن کامل

Unavoidable minors of large 4 - connected

11 It is known that any 3-connected matroid that is large enough is certain to contain 12 a minor of a given size belonging one of a few special classes of matroids. This 13 paper proves a similar unavoidable minor result for large 4-connected bicircular 14 matroids. The main result follows from establishing the list of unavoidable minors 15 of large 4-biconnected graphs, which are the graphs r...

متن کامل

On the Complexity of Computing the Tutte Polynomial of Bicircular Matroids

We show that evaluating the Tutte polynomial for the class of bicircular matroids is #Phard at every point (x, y) except those in the hyperbola (x − 1)(y − 1) = 1 and possibly those on the lines x = 0 and x = −1. Since bicircular matroids form a rather restricted subclass of transversal matroids, our results can be seen as a partial strengthening of a result by Colbourn, Provan and Vertigan, na...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 23  شماره 

صفحات  -

تاریخ انتشار 2016